Flexible user query order for the speculative query support in RDBMS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speculative Query Processing

Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many successfull applications of speculation: modern processors, for example, speculate on the run-time properties of a program and decide to pre-execute instructions accordingly. We draw inspiration from these techniques and ...

متن کامل

Efficient XML Query Processing in RDBMS Using GUI-Driven Prefetching in a Single-User Environment

In this paper, we address the problem of efficient processing of XQueries in single-user relational environment where the queries are formulated using a user-friendly GUI. We take a novel and non-traditional approach to improving query performance by prefetching data during the formulation of a query. The latency offered by GUI-based query formulation is utilized to prefetch portions of the que...

متن کامل

Flexible query processing for SPARQL

Flexible querying techniques can enhance users’ access to complex, heterogeneous datasets in settingssuch as Linked Data, where the user may not always know how a query should be formulated in order to retrievethe desired answers. This paper presents query processing algorithms for a fragment of SPARQL 1.1 incorporatingregular path queries (property path queries), extended with quer...

متن کامل

Query Brokers for Distributed and Flexible Query Evaluation

This paper presents our work on supporting flexible query evaluation over large distributed, heterogeneous, and autonomous sources. Flexibility means that the query evaluation process can be configured according to application contextspecific, resources constraints and also can interact with its execution environment. Our query evaluation is based on Query Brokers as basic units which allow the...

متن کامل

Query Order

We study the effect of query order on computational power, and show that Pj k—the languages computable via a polynomial-time machine given one query to the jth level of the boolean hierarchy followed by one query to the kth level of the boolean hierarchy—equals Rpj+2k−1-tt(NP) if j is even and k is odd, and equals Rpj+2k-tt(NP) otherwise. Thus, unless the polynomial hierarchy collapses, it hold...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Science and Information Systems (FedCSIS), 2019 Federated Conference on

سال: 2022

ISSN: ['2300-5963']

DOI: https://doi.org/10.15439/2022f154